Note—Dynamic Facility Location and Simple Network Models
نویسندگان
چکیده
منابع مشابه
Hierarchical Facility Location and Hub Network Problems: A literature review
In this paper, a complete review of published researches about hierarchical facility location and hub network problems is presented. Hierarchical network is a system where facilities with different service levels interact in a top-down way or vice versa. In Hierarchical systems, service levels are composed of different facilities. Published papers from (1970) to (2015) have been studied and a c...
متن کاملInverse and Reverse 2-facility Location Problems with Equality Measures on a Network
In this paper we consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse c...
متن کاملCapacitated facility location/network design problems
We introduce a combined facility location/network design problem in which facilities have constraining capacities on the amount of demand they can serve. This model has a number of applications in regional planning, distribution, telecommunications, energy management, and other areas. Our model includes the classical capacitated facility location problem (CFLP) on a network as a special case. W...
متن کاملContinuous Facility Location with Backbone Network Costs
We consider a continuous facility location problem in which our objective is to minimize the weighted sum of three costs: fixed costs from installing the facilities, backbone network costs incurred from connecting the facilities to each other, and transportation costs incurred from providing services from the facilities to the service region. We first analyze the limiting behavior of this model...
متن کاملNetwork Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined. This problem is known to be NPComplete for general graph. The problem remains NPComplete even when the vertices of the network are required to lie on the boundary of a convex polygon in the Euclidean plane. We present...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 1974
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.20.9.1311